Enumerating Pattern Avoidance for Affine Permutations
نویسندگان
چکیده
منابع مشابه
Enumerating Pattern Avoidance for Affine Permutations
In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in S̃n that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S3, as well as give some conjectures for the patterns in S4.
متن کاملExtended Abstract for Enumerating Pattern Avoidance for Affine Permutations
In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in S̃n that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S3, as well as give some conjectures for the patterns in S4. This paper is just ...
متن کاملPattern Avoidance in Coloured Permutations
Let Sn be the symmetric group, Cr the cyclic group of order r, and let S (r) n be the wreath product of Sn and Cr; which is the set of all coloured permutations on the symbols 1, 2, . . . , n with colours 1, 2, . . . , r, which is the analogous of the symmetric group when r = 1, and the hyperoctahedral group when r = 2. We prove, for every 2letter coloured pattern φ ∈ S 2 , that the number of φ...
متن کاملPattern Avoidance in Partial Permutations
Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols π = π1π2 · · · πn in which each of the symbols from the set {1, 2, . . . , n− k} appears exactly once, while the remaining k symbols of π are “holes”. A. Claesson, V. Jeĺınek and S. Kitaev were supported by the Icelandic Re...
متن کاملAlgebraic and Affine Pattern Avoidance
We investigate various connections between the 0Hecke monoid, Catalan monoid, and pattern avoidance in permutations, providing new tools for approaching pattern avoidance in an algebraic framework. In particular, we characterize containment of a class of ‘long’ patterns as equivalent to the existence of a corresponding factorization. We then generalize some of our constructions to the affine se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/399